Numerical approximation of continuous traffic congestion equilibria
نویسندگان
چکیده
Starting from a continuous congested traffic framework recently introduced in [8], we present a consistent numerical scheme to compute equilibrium metrics. We show that equilibrium metric is the solution of a variational problem involving geodesic distances. Our discretization scheme is based on the Fast Marching Method. Convergence is proved via a Γ-convergence result and numerical results are given.
منابع مشابه
m at h . O C / 0 61 27 19 v 1 22 D ec 2 00 6 Optimal transportation with traffic congestion and Wardrop equilibria
In the classical Monge-Kantorovich problem, the transportation cost only depends on the amount of mass sent from sources to destinations and not on the paths followed by this mass. Thus, it does not allow for congestion effects. Using the notion of traffic intensity, we propose a variant taking into account congestion. This leads to an optimization problem posed on a set of probability measures...
متن کاملNumerical solutions of continuum equilibria for routing in dense ad-hoc networks
We study the routing problem in massively dense static adhoc networks as the node density increases. We use a fluid approximation in which the graph providing the available routes becomes so dense that it can be approximated by a continuous area which inherits from the original problem the cost structure: a cost density is defined at each point on the limit plain; it is a function of the locati...
متن کاملFrom discrete to continuous Wardrop equilibria
The notion of Wardrop equilibrium in congested networks has been very popular in congested traffic modelling since its introduction in the early 50’s, it is also well-known that Wardrop equilibria may be obtained by some convex minimization problem. In this paper, in the framework of Γ-convergence theory, we analyze what happens when a cartesian network becomes very dense. The continuous model ...
متن کاملResource Replenishment Location Planning for Service Trucks under Network Congestion and Routing Constraints
It is often very challenging to plan expedient and cost-effective operations for service trucks under network design constraints, particularly on congested urban roadways. Hence, it is beneficial to simultaneously account for truck facility location design and network expansion decisions to mitigate the additional congestion caused by trucks and facilitate their routing. This paper develops an ...
متن کاملOnline Learning of Nash Equilibria in Congestion Games
We study the repeated, nonatomic congestion game, in which multiple populations of players share resources and make, at each iteration, a decentralized decision on which resources to utilize. We investigate the following question: given a model of how individual players update their strategies, does the resulting dynamics of strategy profiles converge to the set of Nash equilibria of the one-sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- NHM
دوره 4 شماره
صفحات -
تاریخ انتشار 2009